Bernoulli sums and Rényi entropy inequalities

نویسندگان

چکیده

We investigate the Rényi entropy of sums independent integer-valued random variables through Fourier theoretic means, and give sharp comparisons between variance for Bernoulli variables. As applications, we prove that a discrete “min-entropy power” is superadditive with respect to convolution modulo universal constant, new bounds on an entropic generalization Littlewood-Offord problem are in “Poisson regime”.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Rényi entropy power inequalities

This paper is a follow-up of a recent work by Bobkov and Chistyakov, obtaining some improved Rényi entropy power inequalities (R-EPIs) for sums of independent random vectors. The first improvement relies on the same bounding techniques used in the former work, while the second significant improvement relies on additional interesting properties from matrix theory. The improvements obtained by th...

متن کامل

Two-moment inequalities for Rényi entropy and mutual information

This paper explores some applications of a twomoment inequality for the integral of the r-th power of a function, where 0 < r < 1. The first contribution is an upper bound on the Rényi entropy of a random vector in terms of the two different moments. When one of the moments is the zeroth moment, these bounds recover previous results based on maximum entropy distributions under a single moment c...

متن کامل

Smooth Entropy and Rényi Entropy

The notion of smooth entropy allows a unifying, generalized formulation of privacy ampli-cation and entropy smoothing. Smooth entropy is a measure for the number of almost uniform random bits that can be extracted from a random source by probabilistic algorithms. It is known that the R enyi entropy of order at least 2 of a random variable is a lower bound for its smooth entropy. On the other ha...

متن کامل

Maximum Rényi Entropy Rate

Two maximization problems of Rényi entropy rate are investigated: the maximization over all stochastic processes whose marginals satisfy a linear constraint, and the Burg-like maximization over all stochastic processes whose autocovariance function begins with some given values. The solutions are related to the solutions to the analogous maximization problems of Shannon entropy rate.

متن کامل

Encoding Tasks and Rényi Entropy

A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum ρ-th moment of the number of performed tasks are derived. The case where a sequence of tasks is produced by a source and n tasks are jointly described using nR bits is considered. If R is larger than ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bernoulli

سال: 2023

ISSN: ['1573-9759', '1350-7265']

DOI: https://doi.org/10.3150/22-bej1511